SherbyNet - /page/wikibook/entry.mu

Micron Document

<!DOCTYPE html>

<title>Object code optimizer</title>

</head>

<span id="openzim-page-title" class="mw-page-title-main"><span class="mw-page-title-main">Object code optimizer</span></span>

</h1>

</header>

/* start https://en.wikipedia.org/ */

.mw-parser-output .ambox{border:1px solid #a2a9b1;border-left:10px solid #36c;background-color:#fbfbfb;box-sizing:border-box}.mw-parser-output .ambox+link+.ambox,.mw-parser-output .ambox+link+style+.ambox,.mw-parser-output .ambox+link+link+.ambox,.mw-parser-output .ambox+.mw-empty-elt+link+.ambox,.mw-parser-output .ambox+.mw-empty-elt+link+style+.ambox,.mw-parser-output .ambox+.mw-empty-elt+link+link+.ambox{margin-top:-1px}html body.mediawiki .mw-parser-output .ambox.mbox-small-left{margin:4px 1em 4px 0;overflow:hidden;width:238px;border-collapse:collapse;font-size:88%;line-height:1.25em}.mw-parser-output .ambox-speedy{border-left:10px solid #b32424;background-color:#fee7e6}.mw-parser-output .ambox-delete{border-left:10px solid #b32424}.mw-parser-output .ambox-content{border-left:10px solid #f28500}.mw-parser-output .ambox-style{border-left:10px solid #fc3}.mw-parser-output .ambox-move{border-left:10px solid #9932cc}.mw-parser-output .ambox-protection{border-left:10px solid #a2a9b1}.mw-parser-output .ambox .mbox-text{border:none;padding:0.25em 0.5em;width:100%}.mw-parser-output .ambox .mbox-image{border:none;padding:2px 0 2px 0.5em;text-align:center}.mw-parser-output .ambox .mbox-imageright{border:none;padding:2px 0.5em 2px 0;text-align:center}.mw-parser-output .ambox .mbox-empty-cell{border:none;padding:0;width:1px}.mw-parser-output .ambox .mbox-image-div{width:52px}@media(min-width:720px){.mw-parser-output .ambox{margin:0 10%}}@media print{body.ns-0 .mw-parser-output .ambox{display:none!important}}

/* end https://en.wikipedia.org/ */

</style><style data-mw-deduplicate="TemplateStyles:r1248332772">

/* start https://en.wikipedia.org/ */

.mw-parser-output .multiple-issues-text{width:95%;margin:0.2em 0}.mw-parser-output .multiple-issues-text>.mw-collapsible-content{margin-top:0.3em}.mw-parser-output .compact-ambox .ambox{border:none;border-collapse:collapse;background-color:transparent;margin:0 0 0 1.6em!important;padding:0!important;width:auto;display:block}body.mediawiki .mw-parser-output .compact-ambox .ambox.mbox-small-left{font-size:100%;width:auto;margin:0}.mw-parser-output .compact-ambox .ambox .mbox-text{padding:0!important;margin:0!important}.mw-parser-output .compact-ambox .ambox .mbox-text-span{display:list-item;line-height:1.5em;list-style-type:disc}body.skin-minerva .mw-parser-output .multiple-issues-text>.mw-collapsible-toggle,.mw-parser-output .compact-ambox .ambox .mbox-image,.mw-parser-output .compact-ambox .ambox .mbox-imageright,.mw-parser-output .compact-ambox .ambox .mbox-empty-cell,.mw-parser-output .compact-ambox .hide-when-compact{display:none}

/* end https://en.wikipedia.org/ */

</style>

</p>

<p>An <b>object code optimizer</b>, sometimes also known as a <b>post pass optimizer</b> or, for small sections of code, <a href="Peephole_optimizer" class="mw-redirect" title="Peephole optimizer">peephole optimizer</a>, forms part of a software <a href="Compiler" title="Compiler">compiler</a>. It takes the output from the source language compile step - the object code or <a href="Binary_file" title="Binary file">binary file</a> - and tries to replace identifiable sections of the code with replacement code that is more <a href="Algorithmic_efficiency" title="Algorithmic efficiency">algorithmically efficient</a> (usually improved speed).

</p>

<div class="mw-heading mw-heading2"><h2 id="Examples">Examples</h2></div>

<ul><li>The earliest "COBOL Optimizer" was developed by <a href="Capex_Corporation" title="Capex Corporation">Capex Corporation</a> in the mid 1970s for <a href="COBOL" title="COBOL">COBOL</a>. This type of optimizer depended, in this case, upon knowledge of "weaknesses" in the standard IBM COBOL compiler, and actually replaced (or <a href="Patch_(computing)" title="Patch (computing)">patched</a>) sections of the object code with more efficient code. The replacement code might replace a linear <a href="Lookup_table" title="Lookup table">table lookup</a> with a <a href="Binary_search_algorithm" class="mw-redirect" title="Binary search algorithm">binary search</a> for example or sometimes simply replace a relatively slow instruction with a known faster one that was otherwise functionally equivalent within its context. This technique is now known as <a href="Strength_reduction" title="Strength reduction">strength reduction</a>. For example, on the <a href="IBM/360" class="mw-redirect" title="IBM/360">IBM/360</a> hardware the <code>CLI</code> instruction was, depending on the particular model, between twice and 5 times as fast as a <code>CLC</code> instruction for single byte comparisons.<sup id="cite_ref-IBM_1-0" class="reference"><a href="#cite_note-IBM-1"><span class="cite-bracket">[</span>1<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-Evans_1982_2-0" class="reference"><a href="#cite_note-Evans_1982-2"><span class="cite-bracket">[</span>2<span class="cite-bracket">]</span></a></sup></li></ul>

<div class="mw-heading mw-heading3"><h3 id="Advantages">Advantages</h3></div>

<p>The main advantage of re-optimizing existing programs was that the stock of already compiled customer programs (<a href="Object_code" title="Object code">object code</a>) could be improved almost instantly with minimal effort, reducing <a href="CPU" class="mw-redirect" title="CPU">CPU</a> resources at a fixed cost (the price of the <a href="Proprietary_software" title="Proprietary software">proprietary software</a>). A disadvantage was that new releases of COBOL, for example, would require (charged) maintenance to the optimizer to cater for possibly changed internal COBOL algorithms. However, since new releases of COBOL compilers frequently coincided with <a href="Computer_hardware" title="Computer hardware">hardware</a> <a href="Upgrade" title="Upgrade">upgrades</a>, the faster hardware would usually more than compensate for the application programs reverting to their pre-optimized versions (until a supporting optimizer was released).

</p>

<div class="mw-heading mw-heading3"><h3 id="Other_optimizers">Other optimizers</h3></div>

<p>Some binary optimizers do <a href="Executable_compression" title="Executable compression">executable compression</a>, which reduces the <i>size</i> of binary files using generic <a href="Data_compression" title="Data compression">data compression</a> techniques, reducing storage requirements and transfer and loading times, but not improving run-time performance. Actual consolidation of duplicate library modules would also reduce memory requirements.

</p><p>Some binary optimizers utilize <a href="Run_time_(program_lifecycle_phase)" class="mw-redirect" title="Run time (program lifecycle phase)">run-time</a> metrics (<a href="Profiling_(computer_programming)" title="Profiling (computer programming)">profiling</a>) to introspectively improve performance using techniques similar to <a href="Just-in-time_compilation" title="Just-in-time compilation">JIT</a> compilers.

</p>

<div class="mw-heading mw-heading3"><h3 id="Recent_developments">Recent developments</h3></div>

<p>More recently developed "binary optimizers" for various platforms, some claiming <a href="Novelty_(patent)" title="Novelty (patent)">novelty</a> but, nevertheless, essentially using the same (or similar) techniques described above, include:

</p>

<ul><li><a href="IBM" title="IBM">IBM</a> automatic binary optimizer for z/OS (ABO) (2015)<sup id="cite_ref-IBM_ABO_2015_3-0" class="reference"><a href="#cite_note-IBM_ABO_2015-3"><span class="cite-bracket">[</span>3<span class="cite-bracket">]</span></a></sup></li>

<li><a href="IBM" title="IBM">IBM</a> automatic binary optimizer for z/OS (ABO) trial cloud service (2020)<sup id="cite_ref-IBM_ABO_2020_4-0" class="reference"><a href="#cite_note-IBM_ABO_2020-4"><span class="cite-bracket">[</span>4<span class="cite-bracket">]</span></a></sup></li>

<li>The Sun Studio binary code optimizer<sup id="cite_ref-Binopt_5-0" class="reference"><a href="#cite_note-Binopt-5"><span class="cite-bracket">[</span>5<span class="cite-bracket">]</span></a></sup> — which requires a <a href="Software_performance_analysis" class="mw-redirect" title="Software performance analysis">profile</a> phase beforehand</li>

<li>Design and Engineering of a Dynamic Binary Optimizer — from <a href="IBM" title="IBM">IBM</a> T. J. Watson Res. Center (February 2005)<sup id="cite_ref-Duesterwald_2005_6-0" class="reference"><a href="#cite_note-Duesterwald_2005-6"><span class="cite-bracket">[</span>6<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-Xu-Li-Bao-Wang-Huang_2007_7-0" class="reference"><a href="#cite_note-Xu-Li-Bao-Wang-Huang_2007-7"><span class="cite-bracket">[</span>7<span class="cite-bracket">]</span></a></sup></li>

<li>QuaC: binary optimization for fast <a href="Self-modifying_code" title="Self-modifying code">runtime code generation</a> in <a href="C_(programming_language)" title="C (programming language)">C</a><sup id="cite_ref-CSD_1994_8-0" class="reference"><a href="#cite_note-CSD_1994-8"><span class="cite-bracket">[</span>8<span class="cite-bracket">]</span></a></sup> — (which appears to include some elements of JIT)</li>

<li><a href="DynamoRIO" title="DynamoRIO">DynamoRIO</a></li>

<li>COBRA: an adaptive runtime binary optimization framework for multithreaded applications<sup id="cite_ref-Kim-Hse-Yew_2007_9-0" class="reference"><a href="#cite_note-Kim-Hse-Yew_2007-9"><span class="cite-bracket">[</span>9<span class="cite-bracket">]</span></a></sup></li>

<li>Spike executable optimizer (Unix kernel)<sup id="cite_ref-Spike_2010_10-0" class="reference"><a href="#cite_note-Spike_2010-10"><span class="cite-bracket">[</span>10<span class="cite-bracket">]</span></a></sup></li>

<li>"SOLAR" software optimization at link-time and run-time<sup id="cite_ref-SOLAR_11-0" class="reference"><a href="#cite_note-SOLAR-11"><span class="cite-bracket">[</span>11<span class="cite-bracket">]</span></a></sup></li>

<li>Dynimize: CPU performance virtualization<sup id="cite_ref-Dynimize_12-0" class="reference"><a href="#cite_note-Dynimize-12"><span class="cite-bracket">[</span>12<span class="cite-bracket">]</span></a></sup></li>

<li>BOLT: post-link optimizer built on top of the <a href="LLVM" title="LLVM">LLVM</a> framework. Utilizing sample-based profiling, BOLT improves the performance of real-world applications even for highly optimized binaries built with both <a href="Feedback_directed_optimization" class="mw-redirect" title="Feedback directed optimization">feedback directed optimization</a> and <a href="Link-time_optimization" class="mw-redirect" title="Link-time optimization">link-time optimization</a>. For <a href="GNU_Compiler_Collection" title="GNU Compiler Collection">GCC</a> and <a href="Clang" title="Clang">Clang</a> compilers, BOLT speeds up their binaries by up to 20.4% on top of FDO and LTO, and up to 52.1% if the binaries are built without FDO and LTO.<sup id="cite_ref-Panchenko-Auler_2019_13-0" class="reference"><a href="#cite_note-Panchenko-Auler_2019-13"><span class="cite-bracket">[</span>13<span class="cite-bracket">]</span></a></sup></li></ul>

<ul><li><a href="Binary_recompilation" class="mw-redirect" title="Binary recompilation">Binary recompilation</a></li>

<li><a href="Binary_translation" title="Binary translation">Binary translation</a></li>

<li><a href="Dynamic_dead_code_elimination" class="mw-redirect" title="Dynamic dead code elimination">Dynamic dead code elimination</a></li></ul>

<div class="mw-heading mw-heading2"><h2 id="References">References</h2></div>

/* start https://en.wikipedia.org/ */

.mw-parser-output .reflist{margin-bottom:0.5em;list-style-type:decimal}@media screen{.mw-parser-output .reflist{font-size:90%}}.mw-parser-output .reflist .references{font-size:100%;margin-bottom:0;list-style-type:inherit}.mw-parser-output .reflist-columns-2{column-width:30em}.mw-parser-output .reflist-columns-3{column-width:25em}.mw-parser-output .reflist-columns{margin-top:0.3em}.mw-parser-output .reflist-columns ol{margin-top:0}.mw-parser-output .reflist-columns li{page-break-inside:avoid;break-inside:avoid-column}.mw-parser-output .reflist-upper-alpha{list-style-type:upper-alpha}.mw-parser-output .reflist-upper-roman{list-style-type:upper-roman}.mw-parser-output .reflist-lower-alpha{list-style-type:lower-alpha}.mw-parser-output .reflist-lower-greek{list-style-type:lower-greek}.mw-parser-output .reflist-lower-roman{list-style-type:lower-roman}

/* end https://en.wikipedia.org/ */

</style><div class="reflist">

/* start https://en.wikipedia.org/ */

.mw-parser-output cite.citation{font-style:inherit;word-wrap:break-word}.mw-parser-output .citation q{quotes:"\"""\"""'""'"}.mw-parser-output .citation:target{background-color:rgba(0,127,255,0.133)}.mw-parser-output .id-lock-free.id-lock-free a{background:url("./mw/Lock-green.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-limited.id-lock-limited a,.mw-parser-output .id-lock-registration.id-lock-registration a{background:url("./mw/Lock-gray-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-subscription.id-lock-subscription a{background:url("./mw/Lock-red-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .cs1-ws-icon a{background:url("./mw/Wikisource-logo.svg")right 0.1em center/12px no-repeat}body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-free a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-limited a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-registration a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-subscription a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .cs1-ws-icon a{background-size:contain;padding:0 1em 0 0}.mw-parser-output .cs1-code{color:inherit;background:inherit;border:none;padding:inherit}.mw-parser-output .cs1-hidden-error{display:none;color:var(--color-error,#d33)}.mw-parser-output .cs1-visible-error{color:var(--color-error,#d33)}.mw-parser-output .cs1-maint{display:none;color:#085;margin-left:0.3em}.mw-parser-output .cs1-kern-left{padding-left:0.2em}.mw-parser-output .cs1-kern-right{padding-right:0.2em}.mw-parser-output .citation .mw-selflink{font-weight:inherit}@media screen{.mw-parser-output .cs1-format{font-size:95%}html.skin-theme-clientpref-night .mw-parser-output .cs1-maint{color:#18911f}}@media screen and (prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .cs1-maint{color:#18911f}}

/* end https://en.wikipedia.org/ */

</style><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://web.archive.org/web/20100711101128/http://bitsavers.org/pdf/ibm/360/A22_6825-1_360instrTiming.pdf">"Archived copy"</a> <span class="cs1-format">(PDF)</span>. Archived from <a rel="nofollow" class="external text" href="http://www.bitsavers.org/pdf/ibm/360/A22_6825-1_360instrTiming.pdf">the original</a> <span class="cs1-format">(PDF)</span> on 2010-07-11<span class="reference-accessdate">. Retrieved <span class="nowrap">2010-01-07</span></span>.</cite><span class="cs1-maint citation-comment"><code class="cs1-code">{{cite web}}</code>: CS1 maint: archived copy as title (link)</span></span>

</li>

<li id="cite_note-Evans_1982-2"><span class="mw-cite-backlink"><b><a href="#cite_ref-Evans_1982_2-0">^</a></b></span> <span class="reference-text"><cite id="CITEREFEvans1982" class="citation journal cs1">Evans, Michael (1982-12-01). <a rel="nofollow" class="external text" href="https://doi.org/10.1145%2F358728.358732">"Software engineering for the Cobol environment"</a>. <i>Communications of the ACM</i>. <b>25</b> (12): <span class="nowrap">874–</span>882. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://doi.org/10.1145%2F358728.358732">10.1145/358728.358732</a></span>. <a href="S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:17268690">17268690</a>.</cite></span>

</li>

<li id="cite_note-IBM_ABO_2015-3"><span class="mw-cite-backlink"><b><a href="#cite_ref-IBM_ABO_2015_3-0">^</a></b></span> <span class="reference-text"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://www.ibm.com/products/automatic-binary-optimizer-zos">"IBM Automatic Binary Optimizer for z/OS - Overview"</a>. <i>www.ibm.com</i>. 2015. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20201018172402/https://www.ibm.com/products/automatic-binary-optimizer-zos">Archived</a> from the original on 2020-10-18<span class="reference-accessdate">. Retrieved <span class="nowrap">2020-05-15</span></span>.</cite></span>

</li>

<li id="cite_note-IBM_ABO_2020-4"><span class="mw-cite-backlink"><b><a href="#cite_ref-IBM_ABO_2020_4-0">^</a></b></span> <span class="reference-text"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://optimizer.ibm.com/">"IBM Automatic Binary Optimizer for z/OS Trial Cloud Service"</a>. <i>optimizer.ibm.com</i>. 2020. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20210119201500/https://optimizer.ibm.com/">Archived</a> from the original on 2021-01-19<span class="reference-accessdate">. Retrieved <span class="nowrap">2021-10-27</span></span>.</cite></span>

</li>

<li id="cite_note-Binopt-5"><span class="mw-cite-backlink"><b><a href="#cite_ref-Binopt_5-0">^</a></b></span> <span class="reference-text"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="http://developers.sun.com/solaris/articles/binopt.html">"The Binary Code Optimizer"</a>. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20100722060415/http://developers.sun.com/solaris/articles/binopt.html">Archived</a> from the original on 2010-07-22<span class="reference-accessdate">. Retrieved <span class="nowrap">2010-01-07</span></span>.</cite></span>

</li>

<li id="cite_note-Duesterwald_2005-6"><span class="mw-cite-backlink"><b><a href="#cite_ref-Duesterwald_2005_6-0">^</a></b></span> <span class="reference-text"><cite id="CITEREFDuesterwald2005" class="citation journal cs1">Duesterwald, E. (2005). "Design and Engineering of a Dynamic Binary Optimizer". <i>Proceedings of the IEEE</i>. <b>93</b> (2): <span class="nowrap">436–</span>448. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1109%2FJPROC.2004.840302">10.1109/JPROC.2004.840302</a>. <a href="S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:2217101">2217101</a>.</cite></span>

</li>

<li id="cite_note-Xu-Li-Bao-Wang-Huang_2007-7"><span class="mw-cite-backlink"><b><a href="#cite_ref-Xu-Li-Bao-Wang-Huang_2007_7-0">^</a></b></span> <span class="reference-text"><cite id="CITEREFXuLiBaoWang2007" class="citation book cs1">Xu, Chaohao; Li, Jianhui; Bao, Tao; Wang, Yun; Huang, Bo (2007-06-13). <a rel="nofollow" class="external text" href="https://doi.org/10.1145/1254810.1254831">"Metadata driven memory optimizations in dynamic binary translator"</a>. <i>Proceedings of the 3rd international conference on Virtual execution environments - VEE '07</i>. Association for Computing Machinery. pp. <span class="nowrap">148–</span>157. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1145%2F1254810.1254831">10.1145/1254810.1254831</a>. <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>978-1-59593630-1</bdi>. <a href="S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:15234434">15234434</a>. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20211027171912/https://dl.acm.org/doi/10.1145/1254810.1254831">Archived</a> from the original on 2021-10-27<span class="reference-accessdate">. Retrieved <span class="nowrap">2021-10-27</span></span> – via ACM Digital Library.</cite></span>

</li>

<li id="cite_note-CSD_1994-8"><span class="mw-cite-backlink"><b><a href="#cite_ref-CSD_1994_8-0">^</a></b></span> <span class="reference-text"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="http://www.eecs.berkeley.edu/Pubs/TechRpts/1994/CSD-94-792.pdf">"Archived copy"</a> <span class="cs1-format">(PDF)</span>. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20090419013547/http://www.eecs.berkeley.edu/Pubs/TechRpts/1994/CSD-94-792.pdf">Archived</a> <span class="cs1-format">(PDF)</span> from the original on 2009-04-19<span class="reference-accessdate">. Retrieved <span class="nowrap">2010-01-07</span></span>.</cite><span class="cs1-maint citation-comment"><code class="cs1-code">{{cite web}}</code>: CS1 maint: archived copy as title (link)</span></span>

</li>

<li id="cite_note-Kim-Hse-Yew_2007-9"><span class="mw-cite-backlink"><b><a href="#cite_ref-Kim-Hse-Yew_2007_9-0">^</a></b></span> <span class="reference-text"><cite id="CITEREFKimHsuYew2007" class="citation book cs1">Kim, Jinpyo; Hsu, Wei-Chung; Yew, Pen-Chung (2007). "COBRA: An Adaptive Runtime Binary Optimization Framework for Multithreaded Applications". <i>2007 International Conference on Parallel Processing (ICPP 2007)</i>. p. 25. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1109%2FICPP.2007.23">10.1109/ICPP.2007.23</a>. <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>978-0-7695-2933-2</bdi>. <a href="S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:15079211">15079211</a>.</cite></span>

</li>

<li id="cite_note-Spike_2010-10"><span class="mw-cite-backlink"><b><a href="#cite_ref-Spike_2010_10-0">^</a></b></span> <span class="reference-text"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://web.archive.org/web/20100911004025/http://www.cesr.ncsu.edu/fddo4/papers/spike_fddo4.pdf">"Archived copy"</a> <span class="cs1-format">(PDF)</span>. Archived from <a rel="nofollow" class="external text" href="http://www.cesr.ncsu.edu/fddo4/papers/spike_fddo4.pdf">the original</a> <span class="cs1-format">(PDF)</span> on 2010-09-11<span class="reference-accessdate">. Retrieved <span class="nowrap">2010-01-07</span></span>.</cite><span class="cs1-maint citation-comment"><code class="cs1-code">{{cite web}}</code>: CS1 maint: archived copy as title (link)</span></span>

</li>

<li id="cite_note-SOLAR-11"><span class="mw-cite-backlink"><b><a href="#cite_ref-SOLAR_11-0">^</a></b></span> <span class="reference-text"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://web.archive.org/web/20160214082946/http://www.cs.arizona.edu/solar/">""SOLAR" Software Optimization at Link-time And Run-time"</a>. Archived from <a rel="nofollow" class="external text" href="http://www.cs.arizona.edu/solar/">the original</a> on 2016-02-14.</cite></span>

</li>

<li id="cite_note-Dynimize-12"><span class="mw-cite-backlink"><b><a href="#cite_ref-Dynimize_12-0">^</a></b></span> <span class="reference-text"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://dynimize.com/product">"Dynimize Product Overview"</a>. <i>dynimize.com</i>. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20211025205130/https://dynimize.com/product">Archived</a> from the original on 2021-10-25<span class="reference-accessdate">. Retrieved <span class="nowrap">2021-04-26</span></span>.</cite></span>

</li>

<li id="cite_note-Panchenko-Auler_2019-13"><span class="mw-cite-backlink"><b><a href="#cite_ref-Panchenko-Auler_2019_13-0">^</a></b></span> <span class="reference-text"><cite id="CITEREFPanchenkoAulerNellOttoni2019" class="citation book cs1">Panchenko, Maksim; Auler, Rafael; Nell, Bill; Ottoni, Guilherme (2019-02-16). "BOLT: A Practical Binary Optimizer for Data Centers and Beyond". <i>2019 IEEE/ACM International Symposium on Code Generation and Optimization (CGO)</i>. pp. <span class="nowrap">2–</span>14. <a href="ArXiv_(identifier)" class="mw-redirect" title="ArXiv (identifier)">arXiv</a>:<span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://arxiv.org/abs/1807.06735">1807.06735</a></span>. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1109%2FCGO.2019.8661201">10.1109/CGO.2019.8661201</a>. <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>978-1-7281-1436-1</bdi>. <a href="S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:49869552">49869552</a>.</cite></span>

</li>

</ol></div></div></div><div><div class="zim-footer">

This article is issued from <a class="external text" title="Last edited on 2025-07-29" href="https://en.wikipedia.org/wiki/?title=Object_code_optimizer&oldid=1303252277">Wikipedia</a>. The text is available under <a class="external text" href="https://creativecommons.org/licenses/by-sa/4.0/deed.en">Creative Commons Attribution-Share Alike 4.0</a> unless otherwise noted. Additional terms may apply for the media files.

</div>

</div></div>

</div>

</main>

</div>

</body></html>